12
11月
2022
摘要：/**
* 冒泡排序算法
* @param $data
* @return array
*/
function bubbleSort($data) {
$len = count($data);
/**
* 冒泡排序算法
* @param $data
* @return array
*/
function bubbleSort($data) {
$len = count($data);
for ($i = 0; $i < $len; $i++) {
for ($j = 0; $j < $len - $i - 1; $j++) {
if ($data[$j] > $data[$j+1]) {
list($data[$j], $data[$j+1]) = [$data[$j+1], $data[$j]];
}
}
}
return $data;
}
$data = [];
for ($i = 0; $i < 100; $i++) {
$data[] = mt_rand(0, 1000);
}
$list = bubbleSort($data);
foreach ($list as $item) {
printf("%s\t", $item);
}
echo "<br>\n";
